Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
نویسندگان
چکیده
1 I n t r o d u c t i o n Evolutionary algorithms are usually considered to be ill-suited for solving constraint satisfaction problems. Namely, the traditional search operators (mutation and recombination) are 'blind' to the constraints, that is, parents satisfying a certain constraint may very well result in an offspring that violates it. Furthermore, while EAs have a 'basic instinct' to optimize, there is no objective function in a CSP just a set of constraints to be satisfied. Despite such general arguments, in the last years there have been reports on quite a few EAs for solving CSPs having a satisfactory performance. Roughly speaking, these EAs can be divided into two categories: those based on exploiting heuristic information on the constraint network [6, 14, 21, 22], and those using a fitness function (penalty function) that is adapted during the search [2, 4, 5, 7, 9, 10, 17, 18]. In this paper we investigate three methods from the second category: the co-evolutionary method by Paredis [17], the heuristic-based microgenetic algorithm by Dozier et al [4], and the EA with stepwise adaptation of weights by Eiben et al. [10]. We implement three specific evolutionary algorithms based on the corresponding methods, called COE, SAW, and MID, respectively, and compare them on a test suite consisting of randomly generated binary CSPs with finite domains. The results of the experiments are used to assess empirically the relative performance of the three different methods within the same category, thereby providing suggestions as to which implementation of the same general idea is the most promising. We use randomly generated problem instances for the experiments, where the hardness of the problem instances is influenced by two parameters: constraint density and constraint tightness. By running experiments on 25 different combinations of these parameters we gain detailed feedback on EA behavior and can validate theoretical predictions on the location of the
منابع مشابه
Applying Adaptive Evolutionary Algorithms to Hard Problems
This report is based on the work I have done for my Master Thesis project. The project as a whole consists of research done in the eld of evolutionary computation, and it is split into two distinct parts. The main theme is adaptive evolutionary algorithms. The rst part covers the research done on solving binary constraint satisfaction problems using adaptive evolutionary algorithms. This involv...
متن کاملComparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction problems. We find that the evolutionary algorithms are less effect...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملComparing evolutionary algorithms on binary constraint satisfaction problems
Constraint handling is not straightforward in evolutionary algorithms (ea) since the usual search operators, mutation and recombination, are ‘blind’ to constraints. Nevertheless, the issue is highly relevant, for many challenging problems involve constraints. Over the last decade numerous eas for solving constraint satisfaction problems (csp) have been introduced and studied on various problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998